A Dynkin diagram classification theorem arising from a combinatorial problem
نویسندگان
چکیده
منابع مشابه
A Combinatorial Problem Arising From Ecology: the Maximum Empower Problem
The ecologist H. T. Odum introduced a principle of physics, called Maximum Empower, in order to explain self-organization in a system (e.g. physical, biological, social, economical, mathematical, ...). The concept of empower relies on emergy, which is a second notion introduced by Odum for comparing energy systems on the same basis. The roots of these notions trace back to the 50’s (with the wo...
متن کاملA combinatorial problem arising in group theory
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the quotient of a finite solvable group modulo the second Fitting subgroup in terms of the number of irreducible character degrees of the group. Along the way, in...
متن کاملThe numbers game and Dynkin diagram classification results
The numbers game is a one-player game played on a finite simple graph with certain “amplitudes” assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at the nodes using the amplitudes in a certain way. Combinatorial reasoning is used to show that those connected graphs with negative integer amplitudes for whic...
متن کاملOn a Problem of Dynkin
Consider an (L, α)-superdiffusion X on Rd, where L is an uniformly elliptic differential operator in Rd, and 1 < α ≤ 2. The G-polar sets for X are subsets of R×Rd which have no intersection with the graph G of X, and they are related to the removable singularities for a corresponding nonlinear parabolic partial differential equation. Dynkin characterized the G-polarity of a general analytic set...
متن کاملThe Dynkin Diagram R-group
We define an abelian group from the Dynkin diagram of a split real linear Lie group with abelian Cartan subgroups, G, and show that the Rδ,0groups defined by Knapp and Stein are subgroups of it. The proof relies on Vogan’s approach to the R-groups. The R-group of a Dynkin diagram is easily computed just by looking at the diagram, and so it gives, for instance, quick proofs of the fact that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1986
ISSN: 0001-8708
DOI: 10.1016/0001-8708(86)90095-2